By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Volume 8, Issue 4, pp. 871-1152

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Interior Point Trajectories in Semidefinite Programming

D. Goldfarb and K. Scheinberg

pp. 871-886

On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems

C. Kirjner-Neto and E. Polak

pp. 887-915

Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization

Stefano Lucidi, Francesco Rochetich, and Massimo Roma

pp. 916-939

Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions

J. Frédéric Bonnans and Alexander Shapiro

pp. 940-946

Progress Made in Solving the Multicommodity Flow Problem

Richard D. McBride

pp. 947-955

An Interior Random Vector Algorithm for MultiStage Stochastic Linear Programs

Eithan Schweitzer

pp. 956-972

Approximation Schemes for Infinite Linear Programs

Onésimo Hernández-Lerma and Jean B. Lasserre

pp. 973-988

Nonsmooth Shape Optimization Applied to Linear Acoustics

Abderrahmane Habbal

pp. 989-1006

A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming

Florian A. Potra and Rongqin Sheng

pp. 1007-1028

Duality in Reverse Convex Optimization

B. Lemaire

pp. 1029-1037

A New Degeneracy Method and Steepest-Edge--Based Conditioning for LP

Roger Fletcher

pp. 1038-1059

BFGS with Update Skipping and Varying Memory

Tamara G. Kolda, Dianne P. O'Leary, and Larry Nazareth

pp. 1060-1083

Optimal Truss Design by Interior-Point Methods

Florian Jarre, Michal Kocvara, and Jochem Zowe

pp. 1084-1107

A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems

F. Sharifi Mokhtarian and J. L. Goffin

pp. 1108-1131

Primal-Dual Interior Methods for Nonconvex Nonlinear Programming

Anders Forsgren and Philip E. Gill

pp. 1132-1152